RANDOM DRIFT, UNIFORM SELECTION, AND THE DEGREE OF POPULATION DIFFERENTIATION
نویسندگان
چکیده
منابع مشابه
Random Drift, Uniform Selection, and the Degree of Population Differentiation.
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملBackground selection and population differentiation.
A general analytical formula is derived, which predicts the effects of background selection on population differentiation at a neutral locus as a result of its linkage with selected loci of deleterious mutations. The theory is based on the assumptions of random mating, multiplicative fitness, and weak selection in hermaphrodite plants in the island model of population structure. The analytical ...
متن کاملThe evolution and population genetics of the ALDH2 locus: random genetic drift, selection, and low levels of recombination.
The catalytic deficiency of human aldehyde dehydrogenase 2 (ALDH2) is caused by a nucleotide substitution (G1510A; Glu487Lys) in exon 12 of the ALDH2 locus. This SNP, and four non-coding SNPs, including one in the promoter, span 40 kb of ALDH2; these and one downstream STRP have been tested in 37 worldwide populations. Only four major SNP-defined haplotypes account for almost all chromosomes in...
متن کاملUniform Generation of Random Regular Graphs of Moderate Degree
We show how to generate k-regular graphs on n vertices uniformly at random in expected time O(nk3), provided k = O(n1/3). The algorithm employs a modification of a switching argument previously used to count such graphs asymptotically for k = o(n1/3). The asymptotic formula is re-derived, using the new switching argument. The method is applied also to graphs with given degree sequences, provide...
متن کاملUniform generation of random graphs with power-law degree sequences
We give a linear-time algorithm that approximately uniformly generates a randomsimple graph with a power-law degree sequence whose exponent is at least 2.8811.While sampling graphs with power-law degree sequence of exponent at least 3 is fairlyeasy, and many samplers work efficiently in this case, the problem becomes dramaticallymore difficult when the exponent drops below 3; ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolution
سال: 1986
ISSN: 0014-3820,1558-5646
DOI: 10.1111/j.1558-5646.1986.tb00515.x